Pii: S0013-7944(98)00103-9
نویسندگان
چکیده
This paper presents a stochastic model of fatigue crack propagation in ductile alloys that are commonly encountered in mechanical structures and machine components of complex systems (e.g. aircraft, spacecraft, ships and submarines, and power plants). The stochastic model is built upon a deterministic state-space model of fatigue crack propagation under variable-amplitude loading. The (non-stationary) statistic of the crack growth process for center-cracked specimens is obtained as a closed form solution of the stochastic dierential equations. Model predictions are in agreement with experimental data for specimens fabricated from 2024-T3 and 7075-T6 aluminum alloys and Ti-6Al-4 V alloy subjected to constant-amplitude and variable-amplitude loading, respectively. The stochastic model of crack propagation can be executed in real time on an inexpensive platform such as a Pentium processor. # 1998 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Pii: S0013-7944(99)00002-8
A detailed analysis is performed of the plastic deformation in a metal substrate fretted by a ̄atbottomed circular peg under steady normal load and cyclic tangential load. The substrate is coated with a thin layer of soft metal. Two limiting asymptotic problems are identi®ed which characterize small scale yielding behavior in the substrate in the vicinity of the corners of the peg. Deformation ...
متن کاملPii: S0013-7944(98)00112-x
We study thermal crack shielding and thermal shock damage in a double-edge cracked metal-particlereinforced ceramic matrix composite subjected to sudden cooling at the cracked surfaces. Under severe thermal shocks, the crack will grow but will be bridged by the plastically stretched metal particles. A linear softening bridging law is used to describe the metal particle bridging behavior. An int...
متن کاملOn Rational Series and Rational Languages
We study the connections between rational series with coeecients in a semiring and their languages.
متن کاملAn Optimal Parallel Algorithm for Sorting Multisets
We consider the problem of sorting n numbers that contain only k distinct values. We present a randomized arbitrary CRCW PRAM algorithm that runs in O(logn) time using n log k logn processors. The same algorithm runs in O ( logn log logn ) time with a total work of O(n(log k) ) for any fixed > 0. All the stated bounds hold with high probability.
متن کامل